TRS Scheduling for Improved QoS Performance in Cloud System

نویسندگان

چکیده

Numerous methods are analysed in detail to improve task scheduling and data security performance the cloud environment. The involve according factors like makespan, waiting time, cost, deadline, popularity. However, inappropriate for achieving higher performance. Regarding security, existing use various encryption schemes but introduce significant service interruption. This article sketches a practical Real-time Application Centric TRS (Throughput-Resource utilization–Success) Scheduling with Data Security (RATRSDS) model by considering all these issues security. method identifies required resource their claim time receiving requests. Further, list of resources as services, computes throughput support (Thrs) number statements executed complete service. Similarly, Resource utilization (Ruts) idle on any duty cycle total servicing time. Also, value Success (Sus) completions allocations. estimates score (Throughput Success) different using measures. According score, services ranked scheduled. On other side, based requirement requests, Requirement Support (RS). selection is performed allocated. choosing route Route Measure (RSM) enforced Finally, has gets implemented service-based technique. RATRSDS scheme claimed scheduling.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Ray Scheduling for Improved System Performance

The performance of full-featured ray tracers has historically been limited by the hardware’s floating point computational power. However, next generation multi-threaded multi-core architectures promise to provide sufficient CPU power to support real time frame rates. In such systems, the emerging problem will be limited memory system performance in terms of both on-chip cache and DRAM-to-cache ...

متن کامل

QoS Scheduling for Latency-sensitive Cloud Applications

Virtualization based cloud computing hosts networked applications in virtual machines (VMs), and provides each VM the desired degree of performance isolation using resource isolation mechanisms. The current resource sharing methods for virtual machines (VMs) mainly focus on resource proportional share such as CPU amount, memory size and I/O bandwidth, whereas ignore the fact that I/O latency in...

متن کامل

QoS Driven Task Scheduling in Cloud Computing

Cloud computing systems promise to offer pay per use, on demand computing services to users worldwide. Recently, there has been a dramatic increase in the demand for delivering services to a large number of users, so they need to offer differentiated services to users and meet their expected quality requirements. Most of scheduling schemes proceeding nowadays have no QoS (Quality of Service) di...

متن کامل

QoS Constraint Based Workflow Scheduling for Cloud Computing Services

QoS constraint based workflow scheduling described by Directed Acyclic Graph (DAG) has been proved to be a NP-hard problem in Cloud Computing Services, especially for cost minimization under deadline constraint. Due to Deadline Bottom Level (DBL) hasn’t considered the concurrence during the real executing process that cause much more shatter time to solve such problem, this paper proposes a nov...

متن کامل

ComplexCloudSim: Towards Understanding Complexity in QoS-Aware Cloud Scheduling

The cloud is generally assumed to be homogeneous in most of the research efforts related to cloud resource management and the performance of cloud resource can be determined as it is predictable. However, a plethora of complexities are associated with cloud resources in the real world: dynamicity, heterogeneity and uncertainty. For heterogeneous cloud resources experiencing vast dynamic changes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2023

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2023.033300